A Multi-Objective Optimization Scheme for Multicast Routing: A Multitree Approach
نویسندگان
چکیده
In this paper, we propose a multi-objective traffic engineering scheme using different distribution trees to multicast several flows. The aim is to combine into a single aggregated metric, the following weighting objectives: the maximum link utilization, the hop count, the total bandwidth consumption, and the total end-to-end delay. Moreover, our proposal solves the traffic split ratio for multiple trees. We formulate this multi-objective function as one with Non Linear programming with discontinuous derivatives (DNLP). Results obtained using SNOPT solver show that several weighting objectives are decreased and the maximum link utilization is minimized. The problem is NP-hard, therefore, a novel SPT algorithm is proposed for optimizing the different objectives. The behavior we get using this algorithm is similar to what we get with SNOPT solver. The proposed approach can be applied in MPLS networks by allowing the establishment of explicit routes in multicast events. The main contributions of this paper are the optimization model and the formulation of the multi-objective function; and that the algorithm proposed shows polynomial complexity.
منابع مشابه
Multitree-Multiobjective Multicast Routing for Traffic Engineering
This paper presents a new traffic engineering multitreemultiobjective multicast routing algorithm (M-MMA) that solves for the first time the GMM model for Dynamic Multicast Groups. Multitree traffic engineering uses several trees to transmit a multicast demand from a source to a set of destinations in order to balance traffic load, improving network resource utilization. Experimental results ob...
متن کاملMultitree Routing for Multicast Flows: A Genetic Algorithm Approach
To create a multicast routing distribution tree ensuring quality constraints is a NP-Hard problem. Many algorithm have been made to solve this issue, and genetic algorithms (GA) have shown better response times and solutions for this problem. This paper aligns related work by presenting algorithms in multicast routing using GAs and, taking its advantage, gives a proposal for solving this proble...
متن کاملInterference-Aware and Cluster Based Multicast Routing in Multi-Radio Multi-Channel Wireless Mesh Networks
Multicast routing is one of the most important services in Multi Radio Multi Channel (MRMC) Wireless Mesh Networks (WMN). Multicast routing performance in WMNs could be improved by choosing the best routes and the routes that have minimum interference to reach multicast receivers. In this paper we want to address the multicast routing problem for a given channel assignment in WMNs. The channels...
متن کاملA New Method based on Intelligent Water Drops for Multicast Routing in Wireless Mesh Networks
In recent years a new type of wireless networks named wireless mesh networks has drawn the attention of researchers. In order to increase the capacity of mesh network, nodes are equipped with multiple radios tuned on multiple channels emerging multi radio multi channel wireless mesh networks. Therefore, the main challenge of these networks is how to properly assign the channels to the radios. O...
متن کاملGMM-model for Dynamic Multicast Groups using a probabilistic BFS Algorithm
Generalized Multiobjective Multitree model (GMMmodel) considering by the first time multitree-multicast load balancing with splitting in a multiobjective context. To solve the GMM-model, a multiobjective evolutionary algorithm (MOEA) inspired by the Strength Pareto Evolutionary Algorithm (SPEA) was proposed. In this paper, we extends the GMM-model to dynamic multicast groups (i.e., in which egr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Telecommunication Systems
دوره 27 شماره
صفحات -
تاریخ انتشار 2004